#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N];

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  queue<pii> q;
  cin >> m;
  while (m--) {
    int op, c, x, k;
    cin >> op;
    if (op == 1) {
      cin >> c >> x;
      q.push(pii(c, x));
    } else {
      cin >> k;
      ll sum = 0;
      while (q.size() && k) {
        int cnt = q.front().first;
        int x = q.front().second;
        int y = min(cnt, k);
        k -= y;
        cnt -= y;
        sum += 1ll * x * y;
        if (!cnt)
          q.pop();
        else
          q.front().first = cnt;
      }
      cout << sum << endl;
    }
  }
  return 0;
}